Approximate min-max relations on plane graphs
نویسندگان
چکیده
منابع مشابه
Approximate Min-max Relations for Odd Cycles in Planar Graphs
We study the ratio between the minimum size of an odd cycle vertex transversal and the maximum size of a collection of vertex-disjoint odd cycles in a planar graph. We show that this ratio is at most 10. For the corresponding edge version of this problem, Král and Voss recently proved that this ratio is at most 2; we also give a short proof of their result.
متن کاملMin-Max Relations for Odd Cycles in Planar Graphs
Let ν(G) be the maximum number of vertex-disjoint odd cycles of a graph G and τ(G) the minimum number of vertices whose removal makes G bipartite. We show that τ(G) ≤ 6ν(G) if G is planar. This improves the previous bound τ(G) ≤ 10ν(G) by Fiorini, Hardy, Reed and Vetta [Math. Program. Ser. B 110 (2007), 71–91].
متن کاملMin-Max Problems on Factor Graphs
We study the min-max problem in factor graphs, which seeks the assignment that minimizes the maximum value over all factors. We reduce this problem to both min-sum and sum-product inference, and focus on the later. In this approach the min-max inference problem is reduced to a sequence of Constraint Satisfaction Problems (CSP), which allows us to solve the problem by sampling from a uniform dis...
متن کاملMin-Max Problems on Factor-Graphs
We study the min-max problem in factor graphs, which seeks the assignment that minimizes the maximum value over all factors. We reduce this problem to both min-sum and sum-product inference, and focus on the later. This approach reduces the min-max inference problem to a sequence of constraint satisfaction problems (CSPs) which allows us to sample from a uniform distribution over the set of sol...
متن کاملOn a min-max theorem on bipartite graphs
Frank, Sebő and Tardos [4] proved that for any connected bipartite graft (G, T ), the minimum size of a T-join is equal to the maximum value of a partition of A, where A is one of the two colour classes of G. Their proof consists of constructing a partition of A of value |F |, by using a minimum T-join F. That proof depends heavily on the properties of distances in graphs with conservative weig...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Optimization
سال: 2011
ISSN: 1382-6905,1573-2886
DOI: 10.1007/s10878-011-9440-0